computational intractability

См. также в других словарях:

• Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …   Wikipedia

• Computational — may refer to: Computer Computational algebra Computational Aeroacoustics Computational and Information Systems Laboratory Computational and Systems Neuroscience Computational archaeology Computational auditory scene analysis Computational biology …   Wikipedia

• Computational irreducibility — is one of the main ideas proposed by Stephen Wolfram in his book A New Kind of Science. Contents 1 The idea 2 Implications 3 Analysis 4 See also …   Wikipedia

• Computers and Intractability: A Guide to the Theory of NP-Completeness — Computers and Intractability: A Guide to the Theory of NP Completeness …   Wikipedia

• Asymptotic computational complexity — In computational complexity theory, asymptotic computational complexity is the usage of the asymptotic analysis for the estimation of computational complexity of algorithms and computational problems, commonly associated with the usage of the big …   Wikipedia

• Cramer-Shoup cryptosystem — The Cramer Shoup system is an asymmetric key encryption algorithm, and was the first efficient scheme proven to be secure against adaptive chosen ciphertext attack using standard cryptographic assumptions. Its security is based on the… …   Wikipedia

• Karp's 21 NP-complete problems — One of the most important results in computational complexity theory was Stephen Cook s 1971 demonstration of the first (practically relevant) NP complete problem, the boolean satisfiability problem. [cite book|author = Stephen Cook|year =… …   Wikipedia

• Cramer–Shoup cryptosystem — The Cramer–Shoup system is an asymmetric key encryption algorithm, and was the first efficient scheme proven to be secure against adaptive chosen ciphertext attack using standard cryptographic assumptions. Its security is based on the… …   Wikipedia

• Kernelization — In computer science, kernelization is a technique for creating algorithms for fixed parameter tractable problems. Given some language L, the input to a fixed parameter tractable problem is a pair (x, k) where x is a word from L and k is an… …   Wikipedia

• Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …   Wikipedia

• NP-complete — Euler diagram for P, NP, NP complete, and NP hard set of problems In computational complexity theory, the complexity class NP complete (abbreviated NP C or NPC) is a class of decision problems. A decision problem L is NP complete if it is in the… …   Wikipedia